Question 1
Question 2
Question 3
Question 4
In the graph given in above question, what is the minimum possible weight of a path P from vertex 1 to vertex 2 in this graph such that P contains at most 3 edges?
Question 5
An undirected graph G has n nodes. Its adjacency matrix is given by an n × n square matrix whose (i) diagonal elements are 0‘s and (ii) non-diagonal elements are 1‘s. which one of the following is TRUE?
Question 6
Question 7
Question 8
Question 9
Question 10
There are 22 questions to complete.